Skew-symmetric matrix

AT=A.

Remarks (See here:

Proof.

Suppose that A is a skew-symmetric matrix of rank r and dimension n×n. Now r could very well be zero, and since zero is an even number, then A has an even rank. So assume instead that r>0. Consequently, we can pick out exactly r rows, say those with the indices i1,i2,...,ir, which span the entire row space. Given that for a skew-symmetric matrix each column is equal to 1 times the transpose of the corresponding row, therefore every column of the matrix can be expressed as a linear combination of the columns with indices i1,...,ir in the exact same way that the corresponding row is expressed as a linear combination of the rows with these same indices. We know that if we remove a row/column of a matrix that is in the span of the remaining rows/columns, the rank does not change. Thus, we can remove all the nr rows and nr columns remaining and not change the rank. Due to symmetry, every time we remove a row, we remove its corresponding column. This way, we have preserved the structure of the matrix. The resultant submatrix A has dimensions r×r and full rank r.

Suppose for the sake of contradiction that r is odd. We know that AT=A. Then the determinant of this submatrix is

det(A)=det(AT)=det(A)=(1)rdet(A)=det(A)

and therefore det(A)=0. This contradicts our assumption that r0. Hence, r is an even natural number.

diag[A1,A2,,At,0,0,]

where

Ai=αi(0110)

with αi real numbers, i=1,,t.

________________________________________

________________________________________

________________________________________

Author of the notes: Antonio J. Pan-Collantes

antonio.pan@uca.es


INDEX: